Search results for " Oracle"
showing 4 items of 4 documents
Le idee e il muro del suono. I programmi per elaboratore nella più recente giurisprudenza europea
2013
Computer programs in the most recent european case law
L'arte mantica alla prova dello scetticismo nell'Edipo re
2022
Since the beginning of the Sophoclean drama OT, King Oedipus, in his attempt to contrast the plague that afflicts Thebes, has to confront the traditional influence of the Delphic oracles and the opinion of the local seer, Tiresias, who is demanding to interpret the words of the God Apollo. In this sense, the Sophoclean drama seems to set into the Attic scene the main traits of its contemporary public debate (second half of the 5th Century BC) about power and fallibility of both oracles and their human interpreters, the so-called manteis. This paper aims by means of a detailed analysis of the dramatic discourse to investigate the positions expressed by the different characters involved in th…
Sobre De somniís liber de Augerius Ferrerius
2004
E-mail @uv.es: privado (a solicitud del interesado) En este libro Ferrer, en plena época renacentista, hace compatibles las teorías oníricas de los autores griegos con sus principios y punto de vista cristianos. Niega tajantemente que existan ensueños vanos y se interesa por los ensueños naturales, cuya génesis está en el estado psicofísico del individuo. Pero, sobre todo, presta su máxima atención a los ensueños divinos. Establece normas para distinguir éstos de los enviados por los malos espíritus. Afirma que ha descubierto mediante la razón y la propia experiencia claves para la interpretación de los ensueños que los filósofos anteriores no llegaron a descubrir. In this book, published d…
Quantum Identification of Boolean Oracles
2004
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…